Resolving scaling ambiguities with the ℓ1/ℓ2 norm in a blind deconvolution problem with feedback
نویسندگان
چکیده
Compared to more mundane blind deconvolution problems, blind deconvolution in seismic applications involves a feedback mechanism related to the free surface. The presence of this feedback mechanism gives us an unique opportunity to remove ambiguities that have plagued blind deconvolution for a long time. While beneficial, this feedback by itself is insufficient to remove the ambiguities even with `1 constraints. However, when paired with an `1/`2 constraint the feedback allows us to resolve the scaling ambiguity under relatively mild assumptions. Inspired by lifting approaches, we propose to split the sparse signal into positive and negative components and apply an `1/`2 constraint to the difference, thereby obtaining a constraint that is easy to implement. Numerical experiments demonstrate robustness to the initialization as well as to noise in the data. Keywords—Blind deconvolution, l1/l2 norm, lifting, method of multipliers
منابع مشابه
A Noise-Robust Method with Smoothed ℓ1/ℓ2 Regularization for Sparse Moving-Source Mapping
The method described here performs blind deconvolution of the beamforming output in the frequency domain. To provide accurate blind deconvolution, sparsity priors are introduced with a smoothed `1/`2 regularization term. As the mean of the noise in the power spectrum domain depends on its variance in the time domain, the proposed method includes a variance estimation step, which allows more rob...
متن کاملEuclid in a Taxicab: Sparse Blind Deconvolution with Smoothed ℓ1/ℓ2 Regularization
The l1/l2 ratio regularization function has shown good performance for retrieving sparse signals in a number of recent works, in the context of blind deconvolution. Indeed, it benefits from a scale invariance property much desirable in the blind context. However, the l1/l2 function raises some difficulties when solving the nonconvex and nonsmooth minimization problems resulting from the use of ...
متن کاملCoordinate Descent Algorithms for Lasso Penalized Regression
Imposition of a lasso penalty shrinks parameter estimates toward zero and performs continuous model selection. Lasso penalized regression is capable of handling linear regression problems where the number of predictors far exceeds the number of cases. This paper tests two exceptionally fast algorithms for estimating regression coefficients with a lasso penalty. The previously known ℓ2 algorithm...
متن کاملRelation between Blind System Identification and Convolutive Blind Source Separation
1. INTRODUCTION. Traditionally blind source separation (BSS) has often been considered as an inverse problem. In this paper we show that the theoretically optimum convolutive BSS solution corresponds to blind multiple-input multiple-output (MIMO) system identification. By choosing an appropriate filter length we show that for broadband algorithms the well-known ambiguities can be avoided. Ambig...
متن کاملPSO-Optimized Blind Image Deconvolution for Improved Detectability in Poor Visual Conditions
Abstract: Image restoration is a critical step in many vision applications. Due to the poor quality of Passive Millimeter Wave (PMMW) images, especially in marine and underwater environment, developing strong algorithms for the restoration of these images is of primary importance. In addition, little information about image degradation process, which is referred to as Point Spread Function (PSF...
متن کامل